Generalized Twisted Gabidulin Codes
نویسندگان
چکیده
Based on the twisted Gabidulin codes obtained recently by Sheekey, we construct a new family of maximal rank distance codes as a set of qpolynomials over Fqn , which includes the generalized Gabidulin codes and the twisted Gabidulin codes. Their Delsarte duals and adjoint codes are investigated. We also obtain necessary and sufficient conditions for the equivalence between two members of our new family of MRD codes except for several special parameters.
منابع مشابه
Nuclei and automorphism groups of generalized twisted Gabidulin codes
Generalized twisted Gabidulin codes are one of the few known families of maximum rank matrix codes over finite fields. As a subset of m×n matrices, when m = n, the automorphism group of any generalized twisted Gabidulin code has been completely determined by the authors in [14]. In this paper, we consider the same problem for m < n. Under certain conditions on their parameters, we determine the...
متن کاملGeneralised Twisted Gabidulin Codes
We present a new family of maximum rank distance (MRD) codes. The new class contains codes that are neither equivalent to a generalised Gabidulin nor to a twisted Gabidulin code, the only two known general constructions of linear MRD codes.
متن کاملA Decoding Algorithm for Rank Metric Codes
In this work we will present algorithms for decoding rank metric codes. First we will look at a new decoding algorithm for Gabidulin codes using the property of Dickson matrices corresponding to linearized polynomials. We will be using a Berlekamp-Massey-like algorithm in the process. We will show the difference between our and existing algorithms. Apart from being a new algorithm, it is also i...
متن کاملGeneralized weights: an anticode approach
In this paper we study generalized weights as an algebraic invariant of a code. We first describe anticodes in the Hamming and in the rank metric, proving in particular that optimal anticodes in the rank metric coincide with Frobenius-closed spaces. Then we characterize both generalized Hamming and rank weights of a code in terms of the intersection of the code with optimal anticodes in the res...
متن کاملGabidulin Codes that are Generalized Reed Solomon Codes
In this paper, we describe permutations that allow to move from a Gabidulin code to a GENERALIZED REED SOLOMON code. Mathematics Subject Classification: 11T71
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.07855 شماره
صفحات -
تاریخ انتشار 2015